Evolutionary Design of one-dimensional Rule Changing cellular automata using genetic algorithms.
نویسندگان
چکیده
منابع مشابه
Evolutionary Design of Rule Changing Cellular Automata
The difficulty of designing cellular automatons’ transition rules to perform a particular problem has severely limited their applications. In this paper we propose a new programming method of cellular computers using genetic algorithms. We consider a pair of rules and the number of rule iterations as a step in the computer program. The present method is meant to reduce the complexity of a given...
متن کاملEvolutionary Design of a Rule-Changing Artificial Society Using Genetic Algorithms
In this paper we address an artificial society in which action rules change with time. We propose a new method to design the action rules of agents in artificial society that can satisfy specified requests by using genetic algorithms (GAs). In the proposed method, each chromosome in the GA population represents a candidate set of action rules and the number of rule iterations. While the usual m...
متن کاملTransformations of the One-Dimensional Cellular Automata Rule Space
We introduce the notion of double permutation in order to study particular classes of transformations of the one-dimensional cellular automata rule space. These classes of transformations are characterized according to different sets of metrical, language theoretic, and dynamical properties they preserve. Each set of transformations we propose induces an equivalence relation over the cellular a...
متن کاملRobot Path Planning Using Cellular Automata and Genetic Algorithm
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...
متن کاملA classification of one-dimensional cellular automata using infinite computations
This paper proposes an application of the Infinite Unit Axiom and grossone, introduced by Yaroslav Sergeyev (see [15] [19]), to classify one-dimensional cellular automata whereby each class corresponds to a different and distinct dynamical behavior. The forward dynamics of a cellular automaton map are studied via defined classes. Using these classes, along with the Infinite Unit Axiom and gross...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Japanese Society for Artificial Intelligence
سال: 2003
ISSN: 1346-0714,1346-8030
DOI: 10.1527/tjsai.18.325